Footprint Scheduling for Dining-Cryptographer Networks
نویسندگان
چکیده
In many communication scenarios it is not sufficient to protect only the content of the communication, it is necessary to also protect the identity of communicating parties. Various protocols and technologies have been proposed to offer such protection, for example, anonymous proxies, mix-networks, or onion routing. The protocol that offers the strongest anonymity guarantees, namely unconditional sender and recipient untraceability, is the Dining Cryptographer (DC) protocol proposed by Chaum in 1988. Unfortunately the strong anonymity guarantees come at the price of limited performance and scalability and multiple issues that make deployment complicated in practice. In this paper we address one of those issues, namely slot reservation. We propose footprint scheduling as a new technique for participants to negotiate communication slots without losing anonymity and at the same time hiding the number of actively sending users. Footprint scheduling is at the same time simple, efficient and yields excellent results, in particular in very dynamic networks with a frequently changing set of participants and frequently changing activity rate.
منابع مشابه
Notes on DIMACS Work
These are notes based on discussions at DIMACS in May 2008. 1 Dining Cryptographers Figures 1, 2, and 3 describe the master process, the signature and state set of a cryptographer, and the transition relation of a cryptographer, respectively. In the definitions above, each action name is a task. Thus, one of the tasks is {pay i(T ), pay i(F )}. From the discussion about the correctness of Dinin...
متن کاملDining Cryptographers’ Wiki
This paper introduces an implementation of a closed group distributed anonymous wiki based on a Dining Cryptographer (DC) network. We argue that such a wiki application particularly suits the properties of a DC network, e.g., performance is less important, and broadcast communication is needed by default.
متن کاملAnonymous One-Time Broadcast Using Non-interactive Dining Cryptographer Nets with Applications to Voting
All voting protocols proposed so far, with the exception of a few, have the property that the privacy of the ballot is only computational. In this paper we outline a new and conceptually simple approach allowing us to construct a protocol in which the privacy of the ballot is unconditional. Our basic idea is to modify the protocol of Fujioka, Okamoto and Ohta[10], which uses blind signatures so...
متن کاملHerbivore: A Scalable and Efficient Protocol for Anonymous Communication
Anonymity is increasingly important for networked applications amidst concerns over censorship and privacy. In this paper, we describe Herbivore, a peer-to-peer, scalable, tamper-resilient communication system that provides provable anonymity and privacy. Building on dining cryptographer networks, Herbivore scales by partitioning the network into anonymizing cliques. Adversaries able to monitor...
متن کامل